Network winner determination problem

The Winner Determination Problem

A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions

We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by applying subgradient optimization with variable fixing. A number of different bid ordering and selection rules are used in our heuristic. Moreover, an effective local search refinement procedure is presented at the end of our algor...

Parameterizing the winner determination problem for combinatorial auctions

Combinatorial auctions (CAs) have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are self-interested. One challenge, however, is that the winner-determination problem (WDP) for combinatorial auctions is NP-hard in the general case. However, there are ways to leverage meaningful structure in the ...

Grid Computing for Solving the Optimal Winner Determination Problem

Grid computing is a recent technology that has become extremely popular to optimize computing resources and manage data and computing workloads. In this paper, we present a parallel genetic algorithm improved by using a stochastic local search for solving the optimal winner determination problem (WDP) in combinatorial auctions. We give also a parallel implementation of the proposed approach on ...

Probabilistic Possible Winner Determination

We study the computational complexity of the counting version of the POSSIBLE-WINNER problem for elections. In the POSSIBLE-WINNER problem we are given a profile of voters, each with a partial preference order, and ask if there are linear extensions of the votes such that a designated candidate wins. We also analyze a special case of POSSIBLE-WINNER, the MANIPULATION problem. We provide polynom...